Exponential convergence under distributed averaging integral frequency control
نویسندگان
چکیده
منابع مشابه
Exponential convergence under distributed averaging integral frequency control
We investigate the performance and robustness of distributed averaging integral controllers used in the optimal frequency regulation of power networks. We construct a strict Lyapunov function that allows us to quantify the exponential convergence rate of the closed-loop system. As an application, we study the stability of the system in the presence of disruptions to the controllers’ communicati...
متن کاملExponential Averaging under Rapid Quasiperiodic Forcing
We derive estimates on the magnitude of the interaction between a wide class of analytic partial differential equations and a high-frequency quasiperiodic oscillator. Assuming high regularity of initial conditions, the equations are transformed to an uncoupled system of an infinite dimensional dynamical system and a linear quasiperiodic flow on a torus; up to coupling terms which are exponentia...
متن کاملConvergence analysis of a frequency-domain adaptive filter with exponential power averaging and generalized window function
One of the advantages of a Frequency-Domain Adaptive Filter (FDAF’) is that one can achieve convergence at a constant rate over the whole frequency range by choosing the adaptation constant for each frequency bin I equal to the overall adaptation constant divided by an estimate of the input power at this frequency bin. A commonly used method, applied in this paper, to estimate the input power i...
متن کاملConvergence Speed in Distributed Consensus and Averaging
We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence times of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology case is the first to be accompanied by a polynomial-time bound on the worst-case convergence time. Th...
متن کاملFully distributed PageRank computation with exponential convergence
This work studies a fully distributed algorithm for computing the PageRank vector, which is inspired by the Matching Pursuit and features: 1) fully distributed 2) expected converges with exponential rate 3) low storage requirement (two scalar values per page). Illustrative experiments are conducted to verify the findings. I. PROBLEM STATEMENT PageRank vector was proposed by the founders of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2018
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2018.09.010